Tree Composition and Generalized Transformations

ثبت نشده
چکیده

A major goal of research in generative grammar is to correctly characterize the principle constraining the locality of movement. While various proposed principles e.g., subjacency, shortest move, minimal link condition, phase impenetrability condition(PIC) have their differences, they also all have the disturbing property that they are stipulations imposed upon the computational system. For example, one could have a version of minimalism without a shortest move constraint, or the PIC, etc., and such a system would allow all sorts of undesirable locality violations. An alternative line of research, starting with Kroch and Joshi (1985) and given its most recent and rigorous exposition in Frank (to appear), has pursued a more radical course. This work, based on the framework of Tree Adjoining Grammar (TAG), has argued that given an appropriately defined formal system, there is no need for a constraint such as shortest move, since the effects of such a constraint follow from the nature of the formal system. The basic idea is that instead of combining trees and then doing movement, all movement is localized to independently constructed trees, where each tree represents one clause. These trees are then put together using a certain generalized transformation the operation of adjoining, hence Tree Adjoining Grammar (TAG). There are no singulary transformations in a TAG derivation. Instead, the basic elements of the system are pieces of phrase structure, called elementary trees, and movement is captured by using the adjoining operation to insert one tree within another, thus allowing components of a tree to be “stretched” apart. This stretching gives the effect of inter-clausal movement. TAG is related to the derivational system of the

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Compositions of Bottom-Up Tree Series Transformations

Tree series transformations computed by bottom-up tree series transducers are called bottom-up tree series transformations. (Functional) compositions of such transformations are investigated. It turns out that bottom-up tree series transformations over commutative and א0-complete semirings are closed under left-composition with linear bottom-up tree series transformations and right-composition ...

متن کامل

On Infinitesimal Conformal Transformations of the Tangent Bundles with the Generalized Metric

Let  be an n-dimensional Riemannian manifold, and  be its tangent bundle with the lift metric. Then every infinitesimal fiber-preserving conformal transformation  induces an infinitesimal homothetic transformation on .  Furthermore,  the correspondence   gives a homomorphism of the Lie algebra of infinitesimal fiber-preserving conformal transformations on  onto the Lie algebra of infinitesimal ...

متن کامل

Extended Multi Bottom-Up Tree Transducers Composition and Decomposition

Extended multi bottom-up tree transducers are de ned and investigated. They are an extension of multi bottom-up tree transducers by arbitrary, not just shallow, left-hand sides of rules; this includes rules that do not consume input. It is shown that such transducers, even linear ones, can compute all transformations that are computed by linear extended top-down tree transducers, which are a th...

متن کامل

Composition and Decomposition of Extended Multi Bottom-Up Tree Transducers?

Extended multi bottom-up tree transducers are de ned and investigated. They are an extension of multi bottom-up tree transducers by arbitrary, not just shallow, left-hand sides of rules; this includes rules that do not consume input. It is shown that such transducers can compute all transformations that are computed by linear extended top-down tree transducers (which are a theoretical model for...

متن کامل

Compositions of tree series transformations

Tree series transformations computed by bottom-up and top-down tree series transducers are called bottomup and top-down tree series transformations, respectively. (Functional) compositions of such transformations are investigated. It turns out that the class of bottom-up tree series transformations over a commutative and complete semiring is closed under left-composition with linear bottom-up t...

متن کامل

Compositions of Extended Top-down Tree Transducers

Unfortunately, the class of transformations computed by linear extended top-down tree transducers with regular look-ahead is not closed under composition. It is shown that the class of transformations computed by certain linear bimorphisms coincides with the previously mentioned class. Moreover, it is demonstrated that every linear epsilon-free extended top-down tree transducer with regular loo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007